Analysis for a class of winner-take-all model

نویسندگان

  • John Sum
  • Andrew Chi-Sing Leung
  • Peter Kwong-Shun Tam
  • Gilbert H. Young
  • Wing-Kay Kan
  • Lai-Wan Chan
چکیده

Recently we have proposed a simple circuit of winner-take-all (WTA) neural network. Assuming no external input, we have derived an analytic equation for its network response time. In this paper, we further analyze the network response time for a class of winner-take-all circuits involving self-decay and show that the network response time of such a class of WTA is the same as that of the simple WTA model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectra of winner-take-all stochastic neural networks

In Piekniewski & Schreiber (2008) we have developed a simple mathematical model for information flow structure in a class of recurrent neural networks and shown that its asymptotic behaviour is scale-free and admits a description in terms of the so-called winner-take-all dynamics. In the present paper we establish a limit theorem for spectra of the spike-flow graphs induced by the winner-take-a...

متن کامل

Hospital Choice for Cataract Treatments: The Winner Takes Most

Background Transparency in quality of care is an increasingly important issue in healthcare. In many international healthcare systems, transparency in quality is crucial for health insurers when purchasing care on behalf of their consumers, for providers to improve the quality of care (if necessary), and for consumers to choose their provider in case treatment is needed. Conscious consume...

متن کامل

Unifying Contests: from Noisy Ranking to Ratio-Form Contest Success Functions

This paper proposes a multi-winner noisy-ranking contest model. Contestants are ranked in a descending order by their perceived outputs, and rewarded by their ranks. A contestant’s perceivable output increases with his/her autonomous e ort, but is subject to random perturbation. We establish, under plausible conditions, the equivalence between our model and the family of (winner-take-all and mu...

متن کامل

Classifying with Gaussian Mixtures and Clusters

In this paper, we derive classifiers which are winner-take-all (WTA) approximations to a Bayes classifier with Gaussian mixtures for class conditional densities. The derived classifiers include clustering based algorithms like LVQ and k-Means. We propose a constrained rank Gaussian mixtures model and derive a WTA algorithm for it. Our experiments with two speech classification tasks indicate th...

متن کامل

A nonlinear model to generate the winner-take-all competition

This paper is concerned with the phenomenon of winner-take-all competition. In this paper, we propose a continuous-time dynamic model, which is described by an ordinary differential equation and is able to produce the winner-take-all competition by taking advantage of selective positive–negative feedback. The global convergence is proven analytically and the convergence rate is also discussed. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on neural networks

دوره 10 1  شماره 

صفحات  -

تاریخ انتشار 1999